Naive Bayesian Classiier Committees
نویسنده
چکیده
The naive Bayesian classiier provides a very simple yet surprisingly accurate technique for machine learning. Some researchers have examined extensions to the naive Bayesian classiier that seek to further improve the accuracy. For example, a naive Bayesian tree approach generates a decision tree with one naive Bayesian classiier at each leaf. Another example is a constructive Bayesian classiier that eliminates attributes and constructs new attributes using Cartesian products of existing attributes. This paper proposes a simple, but eeective approach for the same purpose. It generates a naive Bayesian classiier committee for a given classiication task. Each member of the committee is a naive Bayesian classiier based on a subset of all the attributes available for the task. During the classiication stage, the committee members vote to predict classes. Experiments across a wide variety of natural domains show that this method signiicantly increases the prediction accuracy of the naive Bayesian classiier on average. It performs better than the two approaches mentioned above in terms of higher prediction accuracy.
منابع مشابه
Geometric Properties of Naive Bayes in Nominal Domains
It is well known that the naive Bayesian classiier is linear in binary domains. However, little work is done on the learnability of the naive Bayesian classiier in nominal domains, a general case of binary domains. This paper explores the geometric properties of the naive Bayesian classiier in nominal domains. First we propose a three-layer measure for the linearity of functions in nominal doma...
متن کاملLazy Bayesian Rules
The naive Bayesian classiier provides a simple and eeective approach to classiier learning, but its attribute independence assumption is often violated in the real world. A number of approaches have sought to alleviate this problem. A Bayesian tree learning algorithm builds a decision tree, and generates a local naive Bayesian classiier at each leaf. The tests leading to a leaf can alleviate at...
متن کاملA Comparison of Induction Algorithms for Selective andnon - Selective Bayesian Classi
In this paper we present a novel induction algorithm for Bayesian networks. This selective Bayesian network classiier selects a subset of attributes that maximizes predictive accuracy prior to the network learning phase, thereby learning Bayesian networks with a bias for small, high-predictive-accuracy networks. We compare the performance of this classiier with selective and non-selective naive...
متن کاملLazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classiier learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classiication. To classify a test example , it creates a conjunctive rule that selects a most appropriate subset of training examples and induces a local naive Bayesian classiier using this subset. Lbr can signii-cantly improve the performance of the naiv...
متن کاملImproving the Performance of Boosting forNaive Bayesian Classi cationKai
This paper investigates boosting naive Bayesian classiica-tion. It rst shows that boosting cannot improve the accuracy of the naive Bayesian classiier on average in a set of natural domains. By analyzing the reasons of boosting's failures, we propose to introduce tree structures into naive Bayesian classiication to improve the performance of boosting when working with naive Bayesian classiicati...
متن کامل